复杂网络社团发现算法研究新进展

社团结构是复杂网络普遍存在的拓扑特性之一,发现复杂网络中的社团结构是复杂网络研究的基础性问题.针对非重叠社团发现和重叠社团发现两类问题,全面综述了当前复杂网络社团发现算法研究的新进展,分析了每类社团发现算法的特点,指出该领域值得进一步探索的研究方向.     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

石英角速率传感器数字相关检测技术研究

为提高石英角速率传感器(QRS)的测量性能,提出了基于数字相关检测技术的QRS信号解调方案。该方案需将一组互相正交的参考信号作为两个相关器的输入,能够同时分离出QRS敏感信号相对于参考信号的同相分量和正交分量。通过角速度提取算法可由以上分量进一步得到输入角速度。分析了实现参考通道功能的两种方法:锁相环(PLL)和Hilbert变换,通过对这两种方法的对比得知,PLL更适合作为QRS相关检测的参考通道。     

液体火箭发动机基于神经网络的实时故障检测算法实现

以某大型液体火箭发动机为研究对象,针对其启动和稳态工作过程,利用Matlab和Lab Windows/CVI等编程工具,基于神经网络技术,开发实现了其地面试车过程实时故障检测的BP(Back Propagation)和RBF(Radial Basis Function)算法。多次试车数据离线检验和实时在线考核结果均表明该方法能够及时、有效地检测出发动机工作过程中的故障,没有出现误报警和漏报警,并能够很好地满足现场试车的实时性和鲁棒性等要求。     

雷达实际平面探测威力模型与仿真算法研究

在考虑地物遮蔽的情况下,建立了3种程式雷达实际平面探测威力的数学模型,并对参数获取、盲区估算等问题进行了讨论。给出了一种基于DEM数据的雷达实际平面探测威力实用算法,实现了雷达在任意高度层的实际平面探测威力的自动仿真生成。应用表明,雷达实际平面探测威力图绘制的精度和效率较传统方法有较大提高。     

基于EMP环境下的导弹作战防护对策分析

EMP武器以其极强的破坏性在现代战争中展现出了显著的作战效能。为了提高EMP环境下导弹作战防护能力,简单分析了EMP的产生过程,阐述了EMP武器在作战运用中的干扰、软(硬)杀伤的作用机理,研究了EMP环境对导弹及测试设备、指挥系统、计算机系统的影响,提出了导弹作战中对EMP的防护应采取设置法拉第笼、可靠接地、滤波等防护对策。     

被动免疫算法在模拟电路故障诊断中的应用研究

基于生物免疫系统的信息处理机理,介绍了被动免疫算法的实现过程,并将其应用到某装备电路板的故障诊断之中。该算法具有边检测边学习的动态调整功能,仿真和实验实例表明,该算法适合于电路板的故障诊断,有较高的故障诊断率。     

扇形搜索下反舰导弹末制导雷达检测性能分析*

反舰导弹末制导雷达在进行自动跟踪前,首先要在方位向和距离向上对目标搜索并进行检测。末制导雷达的检测性能与脉冲积累数目、信杂比和搜索方式密切相关。针对反舰导弹末制导雷达常用的扇形搜索方式,提出一种二项式积累OS-CFAR检测算法。该方法在一个方位搜索周期内对距离向回波进行非相参积累。仿真分析表明,与常规OS-CFAR算法相比,该检测算法提高了末制导雷达的检测性能。